Provably Secure Certificate-based Conditional Proxy Re-encryption
نویسندگان
چکیده
A proxy re-encryption scheme (PRE) allows a semi-trusted proxy to convert a ciphertext encrypted under one key into a ciphertext encrypted under another key without leaking the underlying plaintext. In the process of the arithmetic processing, proxy should be able to learn as little information about the plaintext as possible. Conditional proxy re-encryption (CPRE) is a new cryptography primitive which only those ciphertexts satisfying one condition set by the delegator can be re-encrypted correctly by the proxy. In this paper, we first propose the formal definition and security model of certificate-based conditional proxy re-encryption. Further, we combine the conditional proxy re-encryption with certificate-based encryption and present a certificate-based conditional proxy re-encryption scheme. The proposed scheme is proved secure against chosenciphertext attack (CCA) in the random oracle model. Security of the scheme is reduced to the intractability of the bilinear Diffie-Hellman problem. Finally, we give the efficiency analysis of our scheme.
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملChosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
متن کامل
Proxy Re-encryption from Lattices
We propose a new unidirectional proxy re-encryption scheme based on lattices. Our construction is collusion-safe and does not require any trusted authority for the re-encryption key generation. We extend a recent trapdoor definition for a lattice of Micciancio and Peikert. Our proxy re-encryption scheme is provably CCA-1 secure in the selective model under the standard assumption.
متن کاملProxy Re-encryption from Lattices
We propose a new unidirectional proxy re-encryption scheme based on the hardness of the LWE problem. Our construction is collusionsafe and does not require any trusted authority for the re-encryption key generation. We extend a recent trapdoor definition for a lattice of Micciancio and Peikert. Our proxy re-encryption scheme is provably CCA-1 secure in the selective model under the LWE assumption.
متن کاملConditional Proxy Broadcast Re-Encryption
A proxy re-encryption (PRE) scheme supports the delegation of decryption rights via a proxy, who makes the ciphertexts decryptable by the delegatee. PRE is useful in various applications such as encrypted email forwarding. In this paper, we introduce a more generalized notion of conditional proxy broadcast re-encryption (CPBRE). A CPBRE scheme allows Alice to generate a re-encryption key for so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 32 شماره
صفحات -
تاریخ انتشار 2016